Group actions on graphs related to Krishnan-Sunder subfactors
نویسندگان
چکیده
منابع مشابه
group actions related to non-vanishing elements
we characterize those groups $g$ and vector spaces $v$ such that $v$ is a faithful irreducible $g$-module and such that each $v$ in $v$ is centralized by a $g$-conjugate of a fixed non-identity element of the fitting subgroup $f(g)$ of $g$. we also determine those $v$ and $g$ for which $v$ is a faithful quasi-primitive $g$-module and $f(g)$ has no regular orbit. we do use these to show in ...
متن کاملMaximal harmonic group actions on finite graphs
This paper studies groups of maximal size acting harmonically on a finite graph. Our main result states that these maximal graph groups are exactly the finite quotients of the modular group Γ = 〈 x, y | x = y = 1 〉 of size at least 6. This characterization may be viewed as a discrete analogue of the description of Hurwitz groups as finite quotients of the (2, 3, 7)-triangle group in the context...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملSome Graphs Related to Thompson's Group F
The Schreier graphs of Thompson’s group F with respect to the stabilizer of 12 and generators x0 and x1, and of its unitary representation in L2([0, 1]) induced by the standard action on the interval [0, 1] are explicitly described. The coamenability of the stabilizers of any finite set of dyadic rational numbers is established. The induced subgraph of the right Cayley graph of the positive mon...
متن کاملHalf-Transitive Group Actions on Finite Graphs of Valency 4
The action of a subgroup G of automorphisms of a graph X is said to be 2 -transitive if it is vertexand edgebut not arc-transitive. In this case the graph X is said to be (G, 2)-transitive. In particular, X is 1 2 -transitive if it is (Aut X, 1 2)-transitive. The 2 -transitive action of G on X induces an orientation of the edges of X which is preserved by G. Let X have valency 4. An even length...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2002
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-02-02986-0